منابع مشابه
Random Walk on Periodic Trees
Following Lyons (1990, [4]) we define a periodic tree, restate its branching number and consider a biased random walk on it. In the case of a transient walk, we describe the walk-invariant random periodic tree and calculate the asymptotic rate of escape (speed) of the walk. This is achieved by exploiting the connections between random walks and electric networks.
متن کاملRandom Walk on Periodic Treeschristiane Takacs
Following Lyons (1990, 4]) we deene a periodic tree, restate its branching number and consider a biased random walk on it. In the case of a transient walk, we describe the walk-invariant random periodic tree and calculate the asymptotic rate of escape (speed) of the walk. This is achieved by exploiting the connections between random walks and electric networks. 1. Introduction This paper deals ...
متن کاملCritical Random Walk in Random Environment on Trees
We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges of a tree Γ are i.i.d. random variables whose logarithms have mean zero and finite variance. Then the resulting RWRE is transient if simple random walk on Γ...
متن کاملRandom walk on the incipient infinite cluster on trees
Let G be the incipient infinite cluster (IIC) for percolation on a homogeneous tree of degree n0 +1. We obtain estimates for the transition density of the the continuous time simple random walk Y on G; the process satisfies anomalous diffusion and has spectral dimension 4 3 . 2000 MSC. Primary 60K37; Secondary 60J80, 60J35.
متن کاملRandom Walk Covering of Some Special Trees
For simple random walk on a finite tree, the cover time is the time taken to visit every vertex. For the balanced b-ary tree of height m, the cover time is shown to be asymptotic to 2mb(log b)/(b− 1) as m→∞. On the uniform random labeled tree on n vertices, we give a convincing heuristic argument that the mean time to cover and return to the root is asymptotic to 6(2π)n, and prove a weak O(n) u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 1997
ISSN: 1083-6489
DOI: 10.1214/ejp.v2-15